type github.com/klauspost/compress/zstd.tableEntry
70 uses
github.com/klauspost/compress/zstd (current package)
enc_better.go#L42: table [betterShortTableSize]tableEntry
enc_better.go#L48: dictTable []tableEntry
enc_better.go#L67: e.table = [betterShortTableSize]tableEntry{}
enc_better.go#L175: e.table[nextHashS] = tableEntry{offset: off, val: uint32(cv)}
enc_better.go#L227: e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L284: e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L509: e.table[hashLen(cv1, betterShortTableBits, betterShortLen)] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L536: e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_better.go#L591: e.table[i] = tableEntry{}
enc_better.go#L694: e.table[nextHashS] = tableEntry{offset: off, val: uint32(cv)}
enc_better.go#L748: e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L808: e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L1027: e.table[h1] = tableEntry{offset: off + 1, val: uint32(cv1)}
enc_better.go#L1056: e.table[nextHashS] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_better.go#L1109: e.dictTable = make([]tableEntry, len(e.table))
enc_better.go#L1122: e.dictTable[nextHash] = tableEntry{
enc_better.go#L1126: e.dictTable[nextHash1] = tableEntry{
enc_better.go#L1130: e.dictTable[nextHash2] = tableEntry{
enc_better.go#L1134: e.dictTable[nextHash3] = tableEntry{
enc_dfast.go#L27: longTable [dFastLongTableSize]tableEntry
enc_dfast.go#L32: longTable [dFastLongTableSize]tableEntry
enc_dfast.go#L33: dictLongTable []tableEntry
enc_dfast.go#L49: e.table = [dFastShortTableSize]tableEntry{}
enc_dfast.go#L50: e.longTable = [dFastLongTableSize]tableEntry{}
enc_dfast.go#L133: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L212: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L298: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L299: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L333: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L383: e.table[i] = tableEntry{}
enc_dfast.go#L386: e.longTable[i] = tableEntry{}
enc_dfast.go#L439: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L519: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L602: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L603: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L638: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L690: e.table[i] = tableEntry{}
enc_dfast.go#L693: e.longTable[i] = tableEntry{}
enc_dfast.go#L779: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L860: e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
enc_dfast.go#L947: te0 := tableEntry{offset: index0 + e.cur, val: uint32(cv0)}
enc_dfast.go#L948: te1 := tableEntry{offset: index1 + e.cur, val: uint32(cv1)}
enc_dfast.go#L990: entry := tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_dfast.go#L1052: e.dictLongTable = make([]tableEntry, len(e.longTable))
enc_dfast.go#L1058: e.dictLongTable[hashLen(cv, dFastLongTableBits, dFastLongLen)] = tableEntry{
enc_dfast.go#L1065: e.dictLongTable[hashLen(cv, dFastLongTableBits, dFastLongLen)] = tableEntry{
enc_dfast.go#L1087: e.longTable = *(*[dFastLongTableSize]tableEntry)(e.dictLongTable)
enc_dfast.go#L1099: *(*[dLongTableShardSize]tableEntry)(e.longTable[i*dLongTableShardSize:]) = *(*[dLongTableShardSize]tableEntry)(e.dictLongTable[i*dLongTableShardSize:])
enc_fast.go#L21: type tableEntry struct {
enc_fast.go#L28: table [tableSize]tableEntry
enc_fast.go#L33: dictTable []tableEntry
enc_fast.go#L49: e.table[i] = tableEntry{}
enc_fast.go#L130: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L131: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L258: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L308: e.table[i] = tableEntry{}
enc_fast.go#L367: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L368: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L498: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L547: e.table = [tableSize]tableEntry{}
enc_fast.go#L627: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L629: e.table[nextHash2] = tableEntry{offset: s + e.cur + 1, val: uint32(cv >> 8)}
enc_fast.go#L758: e.table[nextHash] = tableEntry{offset: s + e.cur, val: uint32(cv)}
enc_fast.go#L810: e.dictTable = make([]tableEntry, len(e.table))
enc_fast.go#L822: e.dictTable[nextHash] = tableEntry{
enc_fast.go#L826: e.dictTable[nextHash1] = tableEntry{
enc_fast.go#L850: e.table = *(*[tableSize]tableEntry)(e.dictTable)
enc_fast.go#L863: *(*[shardSize]tableEntry)(e.table[i*shardSize:]) = *(*[shardSize]tableEntry)(e.dictTable[i*shardSize:])
 |
The pages are generated with Golds v0.8.4. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |